C Omputational M Odels for P Arallel C Omputing and Bsp Lab

A major challenge for parallel computing is the development of a standardized combination of portable and efficient parallel programming. An interesting approach towards this major goal is the research with offspring in Leslie Valiant’s Bulk Synchronous Parallel Model (BSP). The BSP model is a theoretical framework outlining how parallel computations can be organized in a way that bridges the gap between the needs of the programmers and the technological possibilities of the computer designers. BSPlab is an environment that makes it possible to develop, debug and measure BSP programs on a variety of parallel computer architectures. The typical use of BSPlab is experiments to learn about the interplay between hardware and software in the search for efficient and portable parallel programming. The project is an offspring from studies on computational models and an interest in using results from theoretical computer science in practical computer engineering. The paper starts by motivating studies of theoretical computer science in general and abstract machines (computational models) in particular. It describes how studies of parallel algorithms led into an interest in abstract machines, the PRAM model and Valiant's BSP model. It describes Valiant's BSP model, and BSP programming. The paper ends by giving a short description of the BSPlab environment, its goals and the current status.